MIP models for production lot sizing problems with distribution costs and cargo arrangement
نویسندگان
چکیده
منابع مشابه
MIP models for production lot sizing problems with distribution costs and cargo arrangement
This study presents mixed integer programming (MIP) models for production lot-sizing problems with distribution costs using unit load devices such as pallets and containers. Problems that integrate production lot-sizing decisions and loading of the products in vehicles (bins) are also modelled, in which constraints such as weight limits, volume restrictions or the value of the cargo loaded in t...
متن کاملLot Sizing with Piecewise Concave Production Costs
We study the lot-sizing problem with piecewise concave production costs and concave holding costs. This problem is a generalization of the lot-sizing problem with quantity discounts, minimum order quantities, capacities, overloading, subcontracting or a combination of these. We develop a dynamic programming (DP) algorithm to solve this problem and answer an open question in the literature: we s...
متن کاملTight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
We study mixed integer programming formulations of variants of the discrete lot–sizing problem. Our approach is to identify simple mixed integer sets within these models and to apply tight formulations for these sets. This allows us to define integral linear programming formulations for the discrete lot–sizing problem in which backlogging and/or safety stocks are present, and to give extended f...
متن کاملOnline lot-sizing problems with ordering, holding and shortage costs
We study inventorymanagement problemswhere demands are revealed incrementally and procurement decisionsmust bemade before the demands are realized. There are no probabilistic distributions nor nontrivial bounds to characterize demands. We consider two cost minimization problems: (1) perishable products with lost sales and (2) durable products with backlogged demand. In both problems, costs are ...
متن کاملMIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world production planning contexts. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is NP-hard. We propose mixed integer programming heuristics based on a planning horizon decomposition s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2016
ISSN: 0160-5682,1476-9360
DOI: 10.1057/jors.2016.12